Reusing Test-Cases on Different Levels of Abstraction in a Model Based Development Tool

Seamless model based development aims to use models during all phases of the development process of a system. During the development process in a component-based approach, components of a system are described at qualitatively differing abstraction levels: during requirements engineering component models are rather abstract high-level and underspecified, while during implementation the component models are rather concrete and fully specified in order to enable code generation. An important issue that arises is assuring that the concrete models correspond to abstract models. In this paper, we propose a method to assure that concrete models for system components refine more abstract models for the same components. In particular we advocate a framework for reusing testcases at different abstraction levels. Our approach, even if it cannot completely prove the refinement, can be used to ensure confidence in the development process. In particular we are targeting the refinement of requirements which are represented as very abstract models. Besides a formal model of our approach, we discuss our experiences with the development of an Adaptive Cruise Control (ACC) system in a model driven development process. This uses extensions which we implemented for our model-based development tool and which are briefly presented in this paper.Comment: In Proceedings MBT 2012, arXiv:1202.582

08351 Abstracts Collection -- Evolutionary Test Generation

From September 24th to September 29th 2008 the Dagstuhl Seminar 08351 ``Evolutionary Test Generation \u27\u27 was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Rule-based Test Generation with Mind Maps

This paper introduces basic concepts of rule based test generation with mind maps, and reports experiences learned from industrial application of this technique in the domain of smart card testing by Giesecke & Devrient GmbH over the last years. It describes the formalization of test selection criteria used by our test generator, our test generation architecture and test generation framework.Comment: In Proceedings MBT 2012, arXiv:1202.582

Formal verification of coupling properties for an automotive software integration across XilL

Virtualization and desktop testing of an integrated system without inclusion of a physical hardware is a well-established concept due to today’s abundant computing power availability. However, only few aspects of reality are introduced in steps into these virtual environments. The aspects of reality like hard-real time deadlines, timing events, coupling frequency and data synchronization between two subsystems in a system offer complexity without fair estimation of its consequence on the system behavior. In this paper, we describe the abovementioned complexity as the coupling properties detailed for a combustion engine example along with its controller. We formally verify the timing, safety, liveness and deadlock properties of the coupling by modeling them as timed transition systems. The example is verified for the idle speed control, smooth mode switching and for injection cutoff control where the interaction between the subsystems is very critical. The paper highlights a very important perspective of strong and weak subsystem coupling while transiting from Model-in-the-loop (MiL) to Software-in-the-Loop (SiL) and finally to Hardware-in-the-Loop (HiL). In conclusion, the input-output behavior of the coupled subsystems is also presented for a realistic observation of the control loop

Constraint-Based Heuristic On-line Test Generation from Non-deterministic I/O EFSMs

We are investigating on-line model-based test generation from non-deterministic output-observable Input/Output Extended Finite State Machine (I/O EFSM) models of Systems Under Test (SUTs). We propose a novel constraint-based heuristic approach (Heuristic Reactive Planning Tester (xRPT)) for on-line conformance testing non-deterministic SUTs. An indicative feature of xRPT is the capability of making reasonable decisions for achieving the test goals in the on-line testing process by using the results of off-line bounded static reachability analysis based on the SUT model and test goal specification. We present xRPT in detail and make performance comparison with other existing search strategies and approaches on examples with varying complexity.Comment: In Proceedings MBT 2012, arXiv:1202.582

Model-Based Testing of Safety Critical Real-Time Control Logic Software

The paper presents the experience of the authors in model based testing of safety critical real-time control logic software. It describes specifics of the corresponding industrial settings and discusses technical details of usage of UniTESK model based testing technology in these settings. Finally, we discuss possible future directions of safety critical software development processes and a place of model based testing techniques in it.Comment: In Proceedings MBT 2012, arXiv:1202.582

Talking quiescence: a rigorous theory that supports parallel composition, action hiding and determinisation

The notion of quiescence - the absence of outputs - is vital in both behavioural modelling and testing theory. Although the need for quiescence was already recognised in the 90s, it has only been treated as a second-class citizen thus far. This paper moves quiescence into the foreground and introduces the notion of quiescent transition systems (QTSs): an extension of regular input-output transition systems (IOTSs) in which quiescence is represented explicitly, via quiescent transitions. Four carefully crafted rules on the use of quiescent transitions ensure that our QTSs naturally capture quiescent behaviour. We present the building blocks for a comprehensive theory on QTSs supporting parallel composition, action hiding and determinisation. In particular, we prove that these operations preserve all the aforementioned rules. Additionally, we provide a way to transform existing IOTSs into QTSs, allowing even IOTSs as input that already contain some quiescent transitions. As an important application, we show how our QTS framework simplifies the fundamental model-based testing theory formalised around ioco.Comment: In Proceedings MBT 2012, arXiv:1202.582

Towards a Mobile Temporal Logic of Actions

I would like to thank my supervisor Fred Kröger. He was willing to discuss at any time, and I could always rely on his full support. I am also thankful to him for his encouragement, especially in some of the rather dragging phases of my work. I am particularly grateful to Stephan Merz. Without his constant support and admirable patience throughout the whole period of writing I probably would not have been able to finish this thesis. I have not only benefited from his extraordinary professional competence, but have also taken advantage of his exceptional human qualities. I also would like to express my gratitude towards Martin Wirsing for providing me with a pleasant working environment by taking me into his group. He always has shown much interest in my work. The idea for the subject of this thesis was initiated by him and Stephan Merz. I feel a need to thank all my friends and my family for not leaving me alone, not even in times when I tended to be almost unbearable... I am aware that I have demanded much of you by asking to share the burden with me. Thank you for no

Exact Gap Computation for Code Coverage Metrics in ISO-C

Test generation and test data selection are difficult tasks for model based testing. Tests for a program can be meld to a test suite. A lot of research is done to quantify the quality and improve a test suite. Code coverage metrics estimate the quality of a test suite. This quality is fine, if the code coverage value is high or 100%. Unfortunately it might be impossible to achieve 100% code coverage because of dead code for example. There is a gap between the feasible and theoretical maximal possible code coverage value. Our review of the research indicates, none of current research is concerned with exact gap computation. This paper presents a framework to compute such gaps exactly in an ISO-C compatible semantic and similar languages. We describe an efficient approximation of the gap in all the other cases. Thus, a tester can decide if more tests might be able or necessary to achieve better coverage.Comment: In Proceedings MBT 2012, arXiv:1202.582